Conjugacy in Thompson’s groups
نویسندگان
چکیده
We give a unified solution the conjugacy problem in Thompson’s groups F , V , and T using strand diagrams, a modification of tree diagrams. We then analyze the complexity of the resulting algorithms. Thompson’s group F is the group of all piecewise-linear homeomorphisms of the unit interval satisfying the following conditions: 1. Every slope is a power of two, and 2. Every breakpoint has dyadic rational coordinates. The group F is finitely presented (with two generators and two relations) and torsion-free. In addition to F , Thompson introduced two other finitely-generated groups known as T and V . Briefly, T is the set of piecewise-linear self-homeomorphisms of the circle [0, 1] / {0, 1} satsifying the two conditions above, while V is the set of piecewise-linear bijections of the interval (or self-homeomorphisms of the Cantor set) satisfying the above conditions. The standard introduction to F , T , and V is [8]. We will assume some familiarity with Thompson’s groups and, in particular, with tree diagrams. In this paper we give a unified solution for the conjugacy problem in Thompson’s groups F, T and V . We introduce strand diagrams, a modification of tree diagrams for these groups, and show how identifying the roots of the two trees defines a conjugacy invariant in all cases. This reduces the conjugacy problem to the study of the isomorphism problem for certain classes of graphs and gives us elementary proofs of some known results. Strand diagrams were first introduced by Pride in his study of the homotopy of relations using the term pictures in [19], [20] and [3] and are dual to the diagrams introduced by Guba and Sapir in [11]. In 1997 Guba and Sapir showed that F can be viewed as a diagram group for the monoid presentation 〈x | x = x〉 [11]. They give a solution for each diagram The first author gratefully acknowledges partial support from an NSF Postdoctoral Research Fellowship while he was at Texas A&M University. This work is part of the second author’s PhD thesis at Cornell University. The second author gratefully acknowledges the Centre de Recerca Matemàtica (CRM) and its staff for the support received during the completion of this work.
منابع مشابه
Conjugacy in Thompson’s Group
We present a characterisation of conjugacy in Thompson’s group using the natural action of F on the interval [0, 1]. This characterisation completes the program begun by Brin and Squier [BS01]. Our characterisation also provides another solution to the conjugacy problem in Thompson’s group which was first solved by Guba and Sapir using diagram groups [GS97]. A number of other solutions exist du...
متن کاملThe Simultaneous Conjugacy Problem in Thompson’s Group F
Guba and Sapir asked, in their joint paper [3], if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson’s group F . We give an elementary proof for the solution of the latter question. This relies purely on the description of F as the group of piecewise linear orientationpreserving homeomorphisms of the unit interval with dyadic breakpoints and slopes tha...
متن کاملThe Conjugacy Problem in Extensions of Thompson’s Group F
We solve the twisted conjugacy problem on Thompson’s group F . We also exhibit orbit undecidable subgroups of Aut(F ), and give a proof that Aut(F ) and Aut+(F ) are orbit decidable provided a certain conjecture on Thompson’s group T is true. By using general criteria introduced by Bogopolski, Martino and Ventura in [5], we construct a family of free extensions of F where the conjugacy problem ...
متن کاملConjugacy in Thompson’s Group F
We complete the program begun by Brin and Squier of characterising conjugacy in Thompson’s group F using the standard action of F as a group of piecewise linear homeomorphisms of the unit interval.
متن کاملar X iv : m at h . G R / 0 50 54 87 v 1 2 4 M ay 2 00 5 Thompson ’ s group and public key cryptography
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established protocols based on numeric computation. Notably, the protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al. exploited the conjugacy search problem in groups, which is a ramification of the discrete logarithm problem. H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008